2 3 Fe b 20 04 Sojourn times in the M / G / 1 FB queue with light - tailed service times
نویسندگان
چکیده
The asymptotic decay rate of the sojourn time of a customer in the stationary M/G/1 queue under the Foreground Background (FB) service discipline is studied. The FB discipline gives service to those customers that have received the least service so far. We prove that for light-tailed service times the decay rate of the sojourn time is equal to the decay rate of the busy period. It is shown that FB minimises the decay rate in the class of work-conserving disciplines.
منابع مشابه
2 00 3 The decay rate of the sojourn time in the M / G / 1 FB queue with light - tailed service times
The asymptotic decay rate of the sojourn time of a customer in the stationary M/G/1 queue under the Foreground Background (FB) service discipline is studied. The FB discipline gives service to those customers that have received the least service so far. It is shown that this decay rate attains the lowest possible value for a work-conserving discipline.
متن کاملThe Foreground-Background Processor-Sharing Queue: a survey
We give an overview of the results in the literature on single-server queues with the Foreground-Background (FB) discipline. The FB discipline gives service to the customer that has received the least amount of service. This not so well-known discipline has some appealing features, and performs very well for heavy-tailed service times. We describe results on the stationary queue length, the max...
متن کاملThe Foregound-Background Processor Sharing Queue: an overview
We give an overview of the results in the literature on single-server queues with the FB discipline. The FB discipline gives service to the customer that has received the least amount of service. This not so well-known discipline has some appealing features, and performs well for heavy-tailed service times. We describe results on the queue length, sojourn time, and the influence of variability ...
متن کاملPreventing Large Sojourn Times Using SMART Scheduling
Recently, the class of SMART scheduling policies has been introduced in order to formalize the common heuristic of “biasing toward small jobs.” We study the tail of the sojourn-time (response-time) distribution under both SMART policies and the Foreground-Background policy (FB) in the GI/GI/1 queue. We prove that these policies behave very well under heavy-tailed service times. Specifically, we...
متن کاملLoss rates in the M/G/1 queue with complete rejection
Consider the M/G /1 queue in which customers are rejected if their total sojourn time would exceed a certain level K. A pasic performance measure of this system is the probability PK that a customer gets rejected in steady state. This paper presents asymptotic expansions for PK as K -+ 00. If the service time B is light-tailed, it is shown that the loss probability has an exponential tail. The ...
متن کامل